/*
 * @Author: sjr
 * @Date: 2021-02-01 06:47:53
 * @LastEditTime: 2021-02-01 06:57:18
 * @LastEditors: sjr
 * @Description: 描述
 * @FilePath: \leetcode\104.二叉树的最大深度.js
 */
/*
 * @lc app=leetcode.cn id=104 lang=javascript
 *
 * [104] 二叉树的最大深度
 */

// @lc code=start
/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var maxDepth = function(root) {
  if(!root) return 0
  let rootLeft = maxDepth(root.left)
  let rootRight = maxDepth(root.right)
  return Math.max(rootLeft, rootRight) + 1
};
// @lc code=end

